Compiling CSPs: A Complexity Map of (Non-Deterministic) Multivalued Decision Diagrams
نویسندگان
چکیده
منابع مشابه
Multivalued Decision Diagrams for Sequencing Problems
Sequencing problems are among the most prominent problems studied in operations research, with primary application in, e.g., scheduling and routing. We propose a novel approach to solving generic sequencing problems using multivalued decision diagrams (MDDs). Because an MDD representation may grow exponentially large, we apply MDDs of limited size as a discrete relaxation to the problem. We sho...
متن کاملRepresenting CSPs with Set-Labeled Diagrams: A Compilation Map
Constraint Satisfaction Problems (CSPs) offer a powerful framework for representing a great variety of problems. Unfortunately, most of the operations associated with CSPs are NP-hard. As some of these operations must be addressed online, compilation structures for CSPs have been proposed, e.g. finitestate automata and Multivalued Decision Diagrams (MDDs). The aim of this paper is to draw a com...
متن کاملCompiling Constraint Networks into Multivalued Decomposable Decision Graphs
We present and evaluate a top-down algorithm for compiling finite-domain constraint networks (CNs) into the language MDDG of multivalued decomposable decision graphs. Though it includes DecisionDNNF as a proper subset, MDDG offers the same key tractable queries and transformations as DecisionDNNF, which makes it useful for many applications. Intensive experiments showed that our compiler cn2mdd...
متن کاملA Constraint Store Based on Multivalued Decision Diagrams
The typical constraint store transmits a limited amount of information because it consists only of variable domains. We propose a richer constraint store in the form of a limited-width multivalued decision diagram (MDD). It reduces to a traditional domain store when the maximum width is one but allows greater pruning of the search tree for larger widths. MDD propagation algorithms can be develo...
متن کاملApproximate Compilation of Constraints into Multivalued Decision Diagrams
We present an incremental refinement algorithm for approximate compilation of constraint satisfaction models into multivalued decision diagrams (MDDs). The algorithm uses a vertex splitting operation that relies on detection of equivalent paths in the MDD. Although the algorithm is quite general, it can be adapted to exploit constraint structure by specializing the path equivalence test to part...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal on Artificial Intelligence Tools
سال: 2014
ISSN: 0218-2130,1793-6349
DOI: 10.1142/s021821301460015x